Digitally Watermarking RSA Moduli
نویسنده
چکیده
The moduli used in RSA (see [5]) can be generated by many different sources. The generator of that modulus knows its factorization. They have the ability to forge signatures or break any system based on this moduli. If a moduli and the RSA parameters associated with it were generated by a reputable source, the system would have higher value than if the parameters were generated by an unknown entity. An RSA modulus is digitally marked, or digitally trade marked, if the generator and other identifying features of the modulus can be identified and possibly verified by the modulus itself. The basic concept of digitally marking an RSA modulus would be to fix the upper bits of the modulus to this tag. Thus anyone who sees the public modulus can tell who generated the modulus and who the generator believes the intended user/owner of the modulus is. Two types of trade marking will be described here. The first is simpler but does not give verifiable trade marking. The second is more complex, but allows for verifiable trade marking of RSA moduli. The second part of this paper describes how to generate an RSA modulus with fixed upper bits.
منابع مشابه
Digital Watermarking Technology in Different Domains
Due to high speed computer networks, the use of digitally formatted data has increased many folds.The digital data can be duplicated and edited with great ease which has led to a need for effectivecopyright protection tools. Digital Watermarking is a technology of embedding watermark withintellectual property rights into images, videos, audios and other multimedia data by a certainalgorithm .Di...
متن کاملGenerating RSA Moduli with a Predetermined Portion
This paper reviews and generalizes a method to generate RSAmoduli with a predetermined portion. The potential advantages of the resultingmethods are discussed: both the storage and the computational requirements ofthe RSA cryptosystem can be considerably reduced. The constructions are as ef-ficient as generation of regular RSA moduli, and the resulting moduli do notseem to o...
متن کاملFactoring RSA Moduli with Weak Prime Factors
In this paper, we study the problem of factoring an RSA modulus N = pq in polynomial time, when p is a weak prime, that is, p can be expressed as ap = u0 + M1u1 + . . . + Mkuk for some k integers M1, . . . ,Mk and k+2 suitably small parameters a, u0, . . . uk. We further compute a lower bound for the set of weak moduli, that is, moduli made of at least one weak prime, in the interval [2, 2] and...
متن کاملRSA-Based Undeniable Signatures for General Moduli
Gennaro, Krawczyk and Rabin gave the first undeniable signature scheme based on RSA signatures. However, their solution required the use of RSA moduli which are a product of safe primes. This paper gives techniques which allow RSA-based undeniable signatures for gen-
متن کاملRSA Moduli with a Predetermined Portion: Techniques and Applications
This paper discusses methods for generating RSA moduli with a predetermined portion. Predetermining a portion enables to represent RSA moduli in a compressed way, which gives rise to reduced transmissionand storage requirements. The first method described in this paper achieves the compression rate of known methods but is fully compatible with the fastest prime generation algorithms available o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2001 شماره
صفحات -
تاریخ انتشار 2001